Multiple association analysis via simulated annealing (MASSA)

نویسنده

  • Miguel Pérez-Enciso
چکیده

SUMMARY Genome-wide association studies are now technically feasible and likely to become a fundamental tool in unraveling the ultimate genetic basis of complex traits. However, new statistical and computational methods need to be developed to extract the maximum information in a realistic computing time. Here we propose a new method for multiple association analysis via simulated annealing that allows for epistasis and any number of markers. It consists of finding the model with lowest Bayesian information criterion using simulated annealing. The data are described by means of a mixed model and new alternative models are proposed using a set of rules, e.g. new sites can be added (or deleted), or new epistatic interactions can be included between existing genetic factors. The method is illustrated with simulated and real data. AVAILABILITY An executable version of the program (MASSA) running under the Linux OS is freely available, together with documentation, at http://www.icrea.es/pag.asp?id=Miguel.Perez.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Scheduling with Multiple Resource Constraints Using a Simulated Annealing-based Algorithm

This paper proposes a new algorithm using Simulated Annealing (SA) for stochastic scheduling. Stochastic effects are added with nondeterministic activity durations. Simple simulated annealing can not properly handle such a complex problem so an improved version is produced and utilized within the algorithm. Generally, the availability of resources is not enough to complete all the current activ...

متن کامل

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...

متن کامل

Adaptive neuro-fuzzy inference system and neural network in predicting the size of monodisperse silica and process optimization via simulated annealing algorithm

In this study, Back-propagation neural network (BPNN) and adaptive neuro-fuzzy inference system (ANFIS) methods were applied to estimate the particle size of silica prepared by sol-gel technique. Simulated annealing algorithm (SAA) employed to determine the optimum practical parameters of the silica production. Accordingly, the process parameters, i.e. tetraethyl orthosilicate (TEOS), H2O and N...

متن کامل

Parallel Continuous Simulated Annealing for Global Optimization

In this paper a parallel algorithm for simulated annealing (S.A.) in the continuous case, the Multiple Trials and Adaptive Supplementary Search, MTASS algorithm, is presented. It is based on a combination of multiple trials, local improved searchs and an adaptive cooling schedule. The results in optimizing some standard test problems are compared with a sequential S.A. algorithms and another pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bioinformatics

دوره 22 5  شماره 

صفحات  -

تاریخ انتشار 2006